Single machine group scheduling with resource dependent setup and processing times : Logistics: From theory to application
Identifieur interne : 006351 ( Main/Exploration ); précédent : 006350; suivant : 006352Single machine group scheduling with resource dependent setup and processing times : Logistics: From theory to application
Auteurs : Adam Janiak [Pologne] ; Mikhail Y. Kovalyov [Biélorussie] ; Marie-Claude Portmann [France]Source :
- European journal of operational research [ 0377-2217 ] ; 2005.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Ressource renouvelable.
English descriptors
- KwdEn :
Abstract
A single machine scheduling problem is studied. There is a partition of the set of n jobs into g groups on the basis of group technology. Jobs of the same group are processed contiguously. A sequence independent setup time precedes the processing of each group. Two external renewable resources can be used to linearly compress setup and job processing times. The setup times are jointly compressible by one resource, the job processing times are jointly compressible by another resource and the level of the resource is the same for all setups and all jobs. Polynomial time algorithms are presented to find an optimal job sequence and resource values such that the total weighted resource consumption is minimum, subject to meeting job deadlines. The algorithms are based on solving linear programming problems with two variables by geometric techniques.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000586
- to stream PascalFrancis, to step Curation: 000452
- to stream PascalFrancis, to step Checkpoint: 000453
- to stream Main, to step Merge: 006590
- to stream Main, to step Curation: 006351
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Single machine group scheduling with resource dependent setup and processing times : Logistics: From theory to application</title><author><name sortKey="Janiak, Adam" sort="Janiak, Adam" uniqKey="Janiak A" first="Adam" last="Janiak">Adam Janiak</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Institute of Engineering Cybernetics, Technical University of Wroclaw</s1><s2>Wroclaw 50372</s2><s3>POL</s3><sZ>1 aut.</sZ></inist:fA14><country>Pologne</country><wicri:noRegion>Wroclaw 50372</wicri:noRegion></affiliation></author><author><name sortKey="Kovalyov, Mikhail Y" sort="Kovalyov, Mikhail Y" uniqKey="Kovalyov M" first="Mikhail Y." last="Kovalyov">Mikhail Y. Kovalyov</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Belarus State University, and United Institute of Informatics Problems, National Academy of Sciences of Belarus</s1><s2>Minsk 220012</s2><s3>BLR</s3><sZ>2 aut.</sZ></inist:fA14><country>Biélorussie</country><wicri:noRegion>Minsk 220012</wicri:noRegion></affiliation></author><author><name sortKey="Portmann, Marie Claude" sort="Portmann, Marie Claude" uniqKey="Portmann M" first="Marie-Claude" last="Portmann">Marie-Claude Portmann</name><affiliation wicri:level="3"><inist:fA14 i1="03"><s1>MACSI team of INRIA-Lorraine and LORIA-INPL, Ecole des Mines de Nancy, Parc de Saurupt</s1><s2>Nancy</s2><s3>FRA</s3><sZ>3 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region">Grand Est</region><region type="old region">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">05-0148336</idno><date when="2005">2005</date><idno type="stanalyst">PASCAL 05-0148336 INIST</idno><idno type="RBID">Pascal:05-0148336</idno><idno type="wicri:Area/PascalFrancis/Corpus">000586</idno><idno type="wicri:Area/PascalFrancis/Curation">000452</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000453</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000453</idno><idno type="wicri:doubleKey">0377-2217:2005:Janiak A:single:machine:group</idno><idno type="wicri:Area/Main/Merge">006590</idno><idno type="wicri:Area/Main/Curation">006351</idno><idno type="wicri:Area/Main/Exploration">006351</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Single machine group scheduling with resource dependent setup and processing times : Logistics: From theory to application</title><author><name sortKey="Janiak, Adam" sort="Janiak, Adam" uniqKey="Janiak A" first="Adam" last="Janiak">Adam Janiak</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Institute of Engineering Cybernetics, Technical University of Wroclaw</s1><s2>Wroclaw 50372</s2><s3>POL</s3><sZ>1 aut.</sZ></inist:fA14><country>Pologne</country><wicri:noRegion>Wroclaw 50372</wicri:noRegion></affiliation></author><author><name sortKey="Kovalyov, Mikhail Y" sort="Kovalyov, Mikhail Y" uniqKey="Kovalyov M" first="Mikhail Y." last="Kovalyov">Mikhail Y. Kovalyov</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Belarus State University, and United Institute of Informatics Problems, National Academy of Sciences of Belarus</s1><s2>Minsk 220012</s2><s3>BLR</s3><sZ>2 aut.</sZ></inist:fA14><country>Biélorussie</country><wicri:noRegion>Minsk 220012</wicri:noRegion></affiliation></author><author><name sortKey="Portmann, Marie Claude" sort="Portmann, Marie Claude" uniqKey="Portmann M" first="Marie-Claude" last="Portmann">Marie-Claude Portmann</name><affiliation wicri:level="3"><inist:fA14 i1="03"><s1>MACSI team of INRIA-Lorraine and LORIA-INPL, Ecole des Mines de Nancy, Parc de Saurupt</s1><s2>Nancy</s2><s3>FRA</s3><sZ>3 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region">Grand Est</region><region type="old region">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName></affiliation></author></analytic><series><title level="j" type="main">European journal of operational research</title><title level="j" type="abbreviated">Eur. j. oper. res.</title><idno type="ISSN">0377-2217</idno><imprint><date when="2005">2005</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">European journal of operational research</title><title level="j" type="abbreviated">Eur. j. oper. res.</title><idno type="ISSN">0377-2217</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Group technology</term><term>Linear programming</term><term>Renewable resources</term><term>Resource allocation</term><term>Scheduling</term><term>Setup time</term><term>Single machine</term><term>Time dependence</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Allocation ressource</term><term>Programmation linéaire</term><term>Ressource renouvelable</term><term>Technologie groupe</term><term>Temps mise en route</term><term>Machine unique</term><term>Ordonnancement</term><term>Dépendance du temps</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Ressource renouvelable</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">A single machine scheduling problem is studied. There is a partition of the set of n jobs into g groups on the basis of group technology. Jobs of the same group are processed contiguously. A sequence independent setup time precedes the processing of each group. Two external renewable resources can be used to linearly compress setup and job processing times. The setup times are jointly compressible by one resource, the job processing times are jointly compressible by another resource and the level of the resource is the same for all setups and all jobs. Polynomial time algorithms are presented to find an optimal job sequence and resource values such that the total weighted resource consumption is minimum, subject to meeting job deadlines. The algorithms are based on solving linear programming problems with two variables by geometric techniques.</div></front></TEI><affiliations><list><country><li>Biélorussie</li><li>France</li><li>Pologne</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Nancy</li></settlement></list><tree><country name="Pologne"><noRegion><name sortKey="Janiak, Adam" sort="Janiak, Adam" uniqKey="Janiak A" first="Adam" last="Janiak">Adam Janiak</name></noRegion></country><country name="Biélorussie"><noRegion><name sortKey="Kovalyov, Mikhail Y" sort="Kovalyov, Mikhail Y" uniqKey="Kovalyov M" first="Mikhail Y." last="Kovalyov">Mikhail Y. Kovalyov</name></noRegion></country><country name="France"><region name="Grand Est"><name sortKey="Portmann, Marie Claude" sort="Portmann, Marie Claude" uniqKey="Portmann M" first="Marie-Claude" last="Portmann">Marie-Claude Portmann</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006351 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 006351 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= Pascal:05-0148336
|texte= Single machine group scheduling with resource dependent setup and processing times : Logistics: From theory to application
}}
| This area was generated with Dilib version V0.6.33. |  |